Measuring time-Frequency information content using the Rényi entropies
نویسندگان
چکیده
The generalized entropies of Rényi inspire new measures for estimating signal information and complexity in the time–frequency plane. When applied to a time–frequency representation (TFR) from Cohen’s class or the affine class, the Rényi entropies conform closely to the notion of complexity that we use when visually inspecting time–frequency images. These measures possess several additional interesting and useful properties, such as accounting and cross-component and transformation invariances, that make them natural for time–frequency analysis. This paper comprises a detailed study of the properties and several potential applications of the Rényi entropies, with emphasis on the mathematical foundations for quadratic TFRs. In particular, for the Wigner distribution, we establish that there exist signals for which the measures are not well defined.
منابع مشابه
A Preferred Definition of Conditional Rényi Entropy
The Rényi entropy is a generalization of Shannon entropy to a one-parameter family of entropies. Tsallis entropy too is a generalization of Shannon entropy. The measure for Tsallis entropy is non-logarithmic. After the introduction of Shannon entropy , the conditional Shannon entropy was derived and its properties became known. Also, for Tsallis entropy, the conditional entropy was introduced a...
متن کاملAnalysis of Remaining Uncertainties and Exponents under Various Conditional Rényi Entropies
In this paper, we analyze the asymptotics of the normalized remaining uncertainty of a source when a compressed or hashed version of it and correlated side-information is observed. For this system, commonly known as Slepian-Wolf source coding, we establish the optimal (minimum) rate of compression of the source to ensure that the remaining uncertainties vanish. We also study the exponential rat...
متن کاملInformation Theoretic Security for Encryption Based on Conditional Rényi Entropies
In this paper, information theoretic cryptography is discussed based on conditional Rényi entropies. Our discussion focuses not only on cryptography but also on the definitions of conditional Rényi entropies and the related information theoretic inequalities. First, we revisit conditional Rényi entropies, and clarify what kind of properties are required and actually satisfied. Then, we propose ...
متن کاملMeasuring Time-Frequency Information and Complexity Using the Renyi Entropies - Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
In search of a n o n p a r a m e t r i c i nd ica to r of d e t e r m i n i s t i c s igna l complexi ty , we link the Rkny i e n t r o p i e s to t imef r equency r ep resen ta t ions . The resu l t i ng measures show promise in seve ra l s i t ua t ions where concepts like the t i m e b a n d w i d t h product fail.
متن کاملRevisiting Conditional Rényi Entropies and Generalizing Shannon’s Bounds in Information Theoretically Secure Encryption
Information theoretic cryptography is discussed based on conditional Rényi entropies. Our discussion focuses not only on cryptography but also on the definitions of conditional Rényi entropies and the related information theoretic inequalities. First, we revisit conditional Rényi entropies, and clarify what kind of properties are required and actually satisfied. Then, we propose security criter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 47 شماره
صفحات -
تاریخ انتشار 2001